19 research outputs found
Globally Continuous and Non-Markovian Crowd Activity Analysis from Videos
Automatically recognizing activities in video is a classic problem in vision and helps to understand behaviors, describe scenes and detect anomalies. We propose an unsupervised method for such purposes. Given video data, we discover recurring activity patterns that appear, peak, wane and disappear over time. By using non-parametric Bayesian methods, we learn coupled spatial and temporal patterns with minimum prior knowledge. To model the temporal changes of patterns, previous works compute Markovian progressions or locally continuous motifs whereas we model time in a globally continuous and non-Markovian way. Visually, the patterns depict flows of major activities. Temporally, each pattern has its own unique appearance-disappearance cycles. To compute compact pattern representations, we also propose a hybrid sampling method. By combining these patterns with detailed environment information, we interpret the semantics of activities and report anomalies. Also, our method fits data better and detects anomalies that were difficult to detect previously
Recommended from our members
A fusion approach for multi-frame optical flow estimation
To date, top-performing optical flow estimation methods only take pairs of consecutive frames into account. While elegant and appealing, the idea of using more than two frames has not yet produced state-of-the-art results. We present a simple, yet effective fusion approach for multi-frame optical flow that benefits from longer-term temporal cues. Our method first warps the optical flow from previous frames to the current, thereby yielding multiple plausible estimates. It then fuses the complementary information carried by these estimates into a new optical flow field. At the time of writing, our method ranks first among published results in the MPI Sintel and KITTI 2015 benchmarks. Our models will be available on https://github.com/NVlabs/PWC-Net
Optimizing edge weights for distributed inference with Gaussian belief propagation
Distributed processing is becoming more important in robotics as low-cost ad hoc networks provide a scalable and robust alternative to tradition centralized processing. Gaussian belief propagation (GaBP) is an effective message-passing algorithm for performing inference on distributed networks, however, its accuracy and convergence can be significantly decreased as networks have higher connectivity and loops. This paper presents two empirically derived methods for weighting the messages in GaBP to minimize error. The first method uses uniform weights based on the average node degree across the network, and the second uses weights determined by the degrees of the nodes at either end of an edge. Extensive simulations show that this results in greatly decreased error, with even greater effects as the network scales. Finally, we present a practical application of this algorithm in the form of a multi-robot localization problem, with our weighting system improving the accuracy of the solution